An Adaptive Parallel Method for Indexing Transportation Moving Objects

An adaptive hashing technique for indexing moving objects

Although hashing techniques are widely used for indexing moving objects, they cannot handle the dynamic workload, e.g. the traffic at peak hour vs. that in the night. This paper proposes an adaptive hashing technique to support the dynamic workload efficiently. The proposed technique maintains two levels of the hashes, one for fast moving objects and the other for quasi-static objects. A moving...

Efficient Update Method for Indexing Locations of Moving Objects

Tracking the changing positions of moving objects is becoming increasingly feasible and necessary. However, traditional spatial index structures are not suitable for storing these positions because of numerous update operations. In this paper, we propose an efficient update method for indexing the locations of moving objects based on the R-tree. This technique updates the structure of the index...

A Network-Based Indexing Method for Trajectories of Moving Objects

Recently many researchers have focused on management of historical trajectories of moving objects due to numerous size of accumulated data over time. However, most of them are concentrated in Euclidean spaces with (x, y, t). In real world, moving objects like vehicles on transportation networks have constraints on their movements, and some of applications need to manage and query them. Previous...

A delineated R-tree indexing method for managing moving objects

An Efficient Indexing Scheme for Multi-dimensional Moving Objects

We consider the problem of indexing a set of objects moving in d-dimensional space along linear trajectories. A simple disk-based indexing scheme is proposed to efficiently answer queries of the form: report all objects that will pass between two given points within a specified time interval. Our scheme is based on mapping the objects to a dual space, where queries about moving objects translat...